A Rare Cuckoo Combination - Rufous Bristle-Bird and Fan-tailed Cuckoo
نویسندگان
چکیده
منابع مشابه
Evolution of bird eggs in the absence of cuckoo parasitism.
Historical introductions of species into new habitats can create rare opportunities to test evolutionary hypotheses, such as the role of natural selection in maintaining traits. This study examines two independent introductions of the African village weaverbird (Ploceus cucullatus) to islands where selection on egg appearance traits is expected to differ markedly from that of the source populat...
متن کاملCuckoo Hashing
We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...
متن کاملFemales are responsible for ejection of cuckoo eggs in the rufous bush robin.
Rufous bush robin, Cercotrichas galactotes, nests were experimentally parasitized in order to test which sex is responsible for egg ejection. We tested nests belonging to the same individuals (male, female or pair) in 2 consecutive years. Whether the eggs were rejected did not depend on environmental variables such as laying date and clutch size, and did not change between tests, when the two c...
متن کاملAdaptive Cuckoo Filters
We introduce the adaptive cuckoo filter (ACF), a data structure for approximate set membership that extends cuckoo filters by reacting to false positives, removing them for future queries. As an example application, in packet processing queries may correspond to flow identifiers, so a search for an element is likely to be followed by repeated searches for that element. Removing false positives ...
متن کاملCuckoo hashing: Further analysis
We consider cuckoo hashing as proposed by Pagh and Rodler in 2001. We show that the expected construction time of the hash table is O(n) as long as the two open addressing tables are each of size at least (1 + ǫ)n, where ǫ > 0 and n is the number of data points. Slightly improved bounds are obtained for various probabilities and constraints. The analysis rests on simple properties of branching ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Emu - Austral Ornithology
سال: 1920
ISSN: 0158-4197,1448-5540
DOI: 10.1071/mu919236